github.com/andybalholm/brotli.hashLongestMatchQuickly.bucketSweep (field)

12 uses

	github.com/andybalholm/brotli (current package)
		hash.go#L237: 			bucketSweep:   1,
		hash.go#L244: 			bucketSweep:   2,
		hash.go#L251: 			bucketSweep:   4,
		hash.go#L290: 			bucketSweep:   4,
		hash_longest_match_quickly.go#L43: 	bucketSweep   int
		hash_longest_match_quickly.go#L51: 	h.buckets = make([]uint32, 1<<h.bucketBits+h.bucketSweep)
		hash_longest_match_quickly.go#L61: 			for j := 0; j < h.bucketSweep; j++ {
		hash_longest_match_quickly.go#L81: 	var off uint32 = uint32(ix>>3) % uint32(h.bucketSweep)
		hash_longest_match_quickly.go#L140: 					if h.bucketSweep == 1 {
		hash_longest_match_quickly.go#L149: 	if h.bucketSweep == 1 {
		hash_longest_match_quickly.go#L182: 		for i = 0; i < h.bucketSweep; (func() { i++; tmp3 := bucket; bucket = bucket[1:]; prev_ix = uint(tmp3[0]) })() {
		hash_longest_match_quickly.go#L213: 	h.buckets[key+uint32((cur_ix>>3)%uint(h.bucketSweep))] = uint32(cur_ix)